HyperNTF: A hypergraph regularized nonnegative tensor factorization for dimensionality reduction

نویسندگان

چکیده

Tensor decomposition is an effective tool for learning multi-way structures and heterogeneous features from high-dimensional data, such as the multi-view images multichannel electroencephalography (EEG) signals, are often represented by tensors. However, most of tensor methods linear feature extraction techniques, which unable to reveal nonlinear structure within data. To address problem, a lot algorithms have been proposed simultaneously performs non-linear extraction. A representative algorithm Graph Regularized Nonnegative Matrix Factorization (GNMF) image clustering. normal 2-order graph can only model pairwise similarity objects, cannot sufficiently exploit complex samples. Thus, we propose novel method, named Hypergraph (HyperNTF), utilizes hypergraph connections among samples employs factor matrix corresponding with last mode Canonical Polyadic (CP) low-dimensional representation original Extensive experiments on synthetic manifolds, real-world datasets, EEG demonstrating that HyperNTF outperforms state-of-the-art in terms dimensionality reduction, clustering, classification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image representation using Laplacian regularized nonnegative tensor factorization

Tensor provides a better representation for image space by avoiding information loss in vectorization. Nonnegative tensor factorization (NTF), whose objective is to express an n-way tensor as a sum of k rank-1 tensors under nonnegative constraints, has recently attracted a lot of attentions for its efficient and meaningful representation. However, NTF only sees Euclidean structures in data spac...

متن کامل

Nonnegative Matrix Factorization for Semi-supervised Dimensionality Reduction

We show how to incorporate information from labeled examples into nonnegative matrix factorization (NMF), a popular unsupervised learning algorithm for dimensionality reduction. In addition to mapping the data into a space of lower dimensionality, our approach aims to preserve the nonnegative components of the data that are important for classification. We identify these components from the sup...

متن کامل

Algorithms for Nonnegative Tensor Factorization

Nonnegative Matrix Factorization (NMF) is an efficient technique to approximate a large matrix containing only nonnegative elements as a product of two nonnegative matrices of significantly smaller size. The guaranteed nonnegativity of the factors is a distinctive property that other widely used matrix factorization methods do not have. Matrices can also be seen as second-order tensors. For som...

متن کامل

Nonnegative Matrix and Tensor Factorization

T here has been a recent surge of interest in matrix and tensor factorization (decomposition), which provides meaningful latent (hidden) components or features with physical or physiological meaning and interpretation. Nonnegative matrix factorization (NMF) and its extension to three-dimensional (3-D) nonnegative tensor factorization (NTF) attempt to recover hidden nonnegative common structures...

متن کامل

Nonnegative Tensor Factorization for Continuous EEG Classification

In this paper we present a method for continuous EEG classification, where we employ nonnegative tensor factorization (NTF) to determine discriminative spectral features and use the Viterbi algorithm to continuously classify multiple mental tasks. This is an extension of our previous work on the use of nonnegative matrix factorization (NMF) for EEG classification. Numerical experiments with two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2022

ISSN: ['0925-2312', '1872-8286']

DOI: https://doi.org/10.1016/j.neucom.2022.09.036